An Augmented Lagrangean Scheme for Capacitated Traac Assignment Problems
نویسنده
چکیده
The inclusion of explicit bounds on the link ows in tra c assignment models has been proposed as a means to obtain a more accurate description of the tra c behaviour than that given by the basic, uncapacitated, model. Although the capacitated problem has the advantage of being numerically more tractable than models involving travel cost functions which tend to in nity as ows approach the link capacities, it has received very limited attention in the past. The main reason for this is that the explicit capacities make the problem computationally more demanding, since they destroy the Cartesian product structure of the feasible set of the uncapacitated model, which enables the development of highly e cient solution procedures for that problem. The availability of e cient procedures for the basic model motivates the use of dualization approaches for handling the capacity constraints of the more complex model; we propose and evaluate an augmented Lagrangean method in which uncapacitated tra c assignment subproblems are solved with the disaggregate simplicial decomposition algorithm. This algorithm fully exploits the subproblems' structure and also has very favourable reoptimization facilities. Both these properties are of greatest importance for achieving computational e ciency of augmented Lagrangean schemes. The overall method exhibits a linear rate of convergence under standard nondegeneracy assumptions. Experiments with medium-scale tra c networks with varying levels of capacities demonstrate that the proposed algorithm is e cient and solves capacitated problems within a factor of, roughly, three to four of the computing times needed to solve the corresponding uncapacitated problems; also, the augmented Lagrangean scheme compares very favourably with both ordinary Lagrangean dualization and penalty methods. The suggested strategy can be utilized for the solution of other extensions of the basic tra c assignment problem where explicit constraints are added in order to re ne the basic model; these constraints can be used to model, for instance, tra c ows at intersections, or di erent categories of vehicles. This way of extending the basic model may be an interesting alternative to the use of asymmetric tra c assignment models, where such extensions are made through the development of complex travel cost functions, which, in practical applications, are di cult to calibrate.
منابع مشابه
An Augmented Lagrangean Scheme for
The inclusion of explicit bounds on the link ows in tra c assignment models has been proposed as a means to obtain a more accurate description of the tra c behaviour than that given by the basic uncapacitated model Although the capacitated problem has the advantage of being numerically more tractable than models involving travel cost functions which tend to in nity as ows approach the link capa...
متن کاملAn Augmented Lagrangean Dual Algorithm for Link Capacity Side Constrained Traac Assignment Problems
As a means to obtain a more accurate description of tra c ows than that provided by the basic model of tra c assignment, there have been suggestions to impose upper bounds on the link ows. This can be done either by introducing explicit link capacities or by employing travel time functions with asymptotes at the upper bounds. Although the latter alternative has the disadvantage of inherent nume...
متن کاملLagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP ) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP , and we propose two different Lagrangean duals based on each of the auxiliary problems. The lower and upper bounds provided by each of the Lagrangean duals reduce notably the set of candidate radii and allow to solve the proble...
متن کاملA Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design
This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversificati...
متن کاملBranch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
This paper presents a branch–and–price algorithm for the Capacitated Hub Location Problem with Single Assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the Restricted Master Problem (RPM). It is shown how to solve the pricing problem for finding new columns to be added to the RMP, or for proving that the lower bound of the current RMP is valid. Also, a lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995